Stability of Oja's PCA Subspace Rule
نویسنده
چکیده
Principal eigenvectors of the data covariance matrix or the subspace spanned by them, called PCA subspace, provide optimal solutions to several information representation tasks. Recently, many neural approaches have been proposed for learning them (see, e.g., Hertz r t a/. 1991; Oja 1992). A well-known algorithm for learning the PCA subspace of the input vectors is so-called Op’s subspace rule (Oja 1989; Hertz et a / . 1991):
منابع مشابه
A roundoff error analysis of the Oja's subspace rule
1]. The PCA neural networks can determine both the transformation vectors the eigenvectors and the KLT of the signal/data to be analyzed in real-time if the networks are implemented in parallel hardware. This paper deals with the effects of finite precision data representation and arithmetics in principal component analysis (PCA) networks. PCA or Karhunen Loéve Transform (KLT) is a statistical ...
متن کاملGlobal convergence of Oja's subspace algorithm for principal component extraction
Oja's principal subspace algorithm is a well-known and powerful technique for learning and tracking principal information in time series. A thorough investigation of the convergence property of Oja's algorithm is undertaken in this paper. The asymptotic convergence rates of the algorithm is discovered. The dependence of the algorithm on its initial weight matrix and the singularity of the data ...
متن کاملGeneralizations of principal component analysis, optimization problems, and neural networks
-We derive and discuss various generalizations of neural PCA (Principal Component Analysis)-type learning algorithms containing nonlinearities using optimization-based approach. Standard PCA arises as an optimal solution to several different information representation problems. We justify that this is essentially due to the fact that the solution is based on the second-order statistics only. I ...
متن کاملHierarchical PCA Using Tree-SOM for the Identification of Bacteria
In this paper we present an extended version of Evolving Trees using Oja’s rule. Evolving Trees are extensions of Self-Organizing Maps developed for hierarchical classification systems. Therefore they are well suited for taxonomic problems like the identification of bacteria. The paper focus on clustering and visualization of bacteria measurements. A modified variant of the Evolving Tree is dev...
متن کاملBlind source separation using least-squares type adaptive algorithms
In this paper adaptive least-squares type algorithms are introduced for blind source separation. They are based on minimizing a criterion used in context with nonlinear PCA (Principal Component Analysis) networks. The new algorithms converge clearly faster and provide more accurate results than typical current adaptive blind separation algorithms based on instantaneous gradients. They are also ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Neural Computation
دوره 6 شماره
صفحات -
تاریخ انتشار 1994